Logic Programming with the Occur-check
نویسنده
چکیده
We present a new procedure based on abstract interpretation for determining where the occur-check may be safely omitted from uniication in an SLD-derivation. The procedure can be used by compilers that allow co-routining and by parallel implementations. It has been designed primarily for a typed language such as GG odel where the type information can be used to improve both the accuracy of the predictions and the eeciency of the analyser. Results obtained with this procedure are summarised at the end of the paper.
منابع مشابه
A Comparison of Three Occur-Check Analysers
A well known problem of most Prolog interpreters and compilers is the lack of occur-check in the implementation of the uniication algorithm. This means that such systems are unsound with respect to rst-order predicate logic. Static analysis ooers an appealing approach to the problem of occur-check reduction, that is, how to safely omit occur-checks in uniication. We compare, for the rst time, t...
متن کاملVeri cation of Logic Programs with Delay Declarations
Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...
متن کاملUniversit a Di Pisa Veriication of Logic Programs Veriication of Logic Programs
We propose a proof method in the style of Hoare's logic, aimed at providing a unifying framework for the veriication of logic and Prolog programs with respect to their speciications. The method, which relies on purely declarative reasoning, has been designed as a trade-oo between expressive power and ease of use. On the basis of a few simple principles, we reason uniformly on several properties...
متن کاملVerification of Logic Programs with Delay Declarations
Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کامل